On the Mean Iteration ( a , b ) < - ( ^ ,
نویسنده
چکیده
The iterative process o-n+i = (an + 36„)/4, i>„+i = (\Janbn + b„)/2 is studied in detail. The limit of this quadratically converging process is explicitly identified, as are the uniformizing parameters. The role of symbolic computation, in discovering these nontrivial identifications, is highlighted.
منابع مشابه
On the Ishikawa iteration process in CAT(0) spaces
In this paper, several $Delta$ and strong convergence theorems are established for the Ishikawa iterations for nonexpansive mappings in the framework of CAT(0) spaces. Our results extend and improve the corresponding results
متن کاملTHE USE OF THE HE'S ITERATION METHOD FOR SOLVING NONLINEAR EQUATIONS USING CADNA LIBRARY
In this paper, we apply the Newton’s and He’s iteration formulas in order to solve the nonlinear algebraic equations. In this case, we use the stochastic arithmetic and the CESTAC method to validate the results. We show that the He’s iteration formula is more reliable than the Newton’s iteration formula by using the CADNA library.
متن کاملAn improved infeasible interior-point method for symmetric cone linear complementarity problem
We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three - centering steps. Here, each iteration consists of only a feasibility step. Thus, the new...
متن کاملA full NT-step O(n) infeasible interior-point method for Cartesian P_*(k) –HLCP over symmetric cones using exponential convexity
In this paper, by using the exponential convexity property of a barrier function, we propose an infeasible interior-point method for Cartesian P_*(k) horizontal linear complementarity problem over symmetric cones. The method uses Nesterov and Todd full steps, and we prove that the proposed algorithm is well define. The iteration bound coincides with the currently best iteration bound for the Ca...
متن کاملOn Time Fractional Modifed Camassa-Holm and Degasperis-Procesi Equations by Using the Haar Wavelet Iteration Method
The Haar wavelet collocation with iteration technique is applied for solving a class of time-fractional physical equations. The approximate solutions obtained by two dimensional Haar wavelet with iteration technique are compared with those obtained by analytical methods such as Adomian decomposition method (ADM) and variational iteration method (VIM). The results show that the present scheme is...
متن کاملOn solving ordinary differential equations of the first order by updating the Lagrange multiplier in variational iteration method
In this paper, we have proposed a new iterative method for finding the solution of ordinary differential equations of the first order. In this method we have extended the idea of variational iteration method by changing the general Lagrange multiplier which is defined in the context of the variational iteration method.This causes the convergent rate of the method increased compared with the var...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010